1,211 research outputs found
Similarity and Probability Distribution Functions in Many-body Stochastic Processes with Multiplicative Interactions
Analytical and numerical studies on many-body stochastic processes with
multiplicative interactions are reviewed. The method of moment relations is
used to investigate effects of asymmetry and randomness in interactions.
Probability distribution functions of the processes generally have similarity
solutions with power-law tails. Growth rates of the system and power-law
exponents of the tails are determined via transcendental equations. Good
agreement is achieved between analytical calculations and Monte Carlo
simulations.Comment: 8 pages, 4 figures, CN-Kyoto proceeding
Semi-supervised learning on closed set lattices
We propose a new approach for semi-supervised learning using closed set lattices, which have been recently used for frequent pattern mining within the framework of the data analysis technique of Formal Concept Analysis (FCA). We present a learning algorithm, called SELF (SEmi-supervised Learning via FCA), which performs as a multiclass classifier and a label ranker for mixed-type data containing both discrete and continuous variables, while only few learning algorithms such as the decision tree-based classifier can directly handle mixed-type data. From both labeled and unlabeled data, SELF constructs a closed set lattice, which is a partially ordered set of data clusters with respect to subset inclusion, via FCA together with discretizing continuous variables, followed by learning classification rules through finding maximal clusters on the lattice. Moreover, it can weight each classification rule using the lattice, which gives a partial order of preference over class labels. We illustrate experimentally the competitive performance of SELF in classification and ranking compared to other learning algorithms using UCI datasets
Topological properties of concept spaces (full version)
AbstractBased on the observation that the category of concept spaces with the positive information topology is equivalent to the category of countably based T0 topological spaces, we investigate further connections between the learning in the limit model of inductive inference and topology. In particular, we show that the “texts” or “positive presentations” of concepts in inductive inference can be viewed as special cases of the “admissible representations” of computable analysis. We also show that several structural properties of concept spaces have well known topological equivalents. In addition to topological methods, we use algebraic closure operators to analyze the structure of concept spaces, and we show the connection between these two approaches. The goal of this paper is not only to introduce new perspectives to learning theorists, but also to present the field of inductive inference in a way more accessible to domain theorists and topologists
- …